FireGuide A Context%2DAware Fire Response Guide for the Building Occupants.

A Logic Based Context Query Language.

Accommodating Smart Meeting Rooms with a Context%2DAware Smart Assistant.



Advances in Data and Web Management

The Impact of Reduced Holding Behavior Information of the Restricted Stock on Market Volatility Based on the Shenzhen Stock Market.

A Quality%2DAware Context Middleware Specification for Context%2DAware Computing.


Learning in an Ambient Intelligent World Enabling Technologies and Practices.


Information Presentation on Mobile Devices Techniques and Practices.

Contextual Ranking of Database Querying Results A Statistical Approach.

Vocal Segment Classification in Popular Music.
This paper explores the vocal and non-vocal music classification problem within popular songs. A newly built labeled database covering 147 popular songs is announced. It is designed for classifying signals from 1sec time windows. Features are selected for this particular task, in order to capture both the temporal correlations and the dependencies among the feature dimensions. We systematically study the performance of a set of classifiers, including linear regression, generalized linear model, Gaussian mixture model, reduced kernel orthonormalized partial least squares and K-means on cross-validated training and test setup. The database is divided in two different ways: with/without artist overlap between training and test sets, so as to study the so called ‘artist effect’. The performance and results are analyzed in depth: from error rates to sample-to-sample error correlation. A voting scheme is proposed to enhance the performance under certain conditions. 1
XML Profile for Distributed Real Time Systems.

Identifying Potentially Important Concepts and Relations in an Ontology.

ODBASE 2008 PC Co%2Dchairs%27 Message.

The Right Expert at the Right Time and Place.

Self%2DSwitching Classification Framework for Titled Documents.

Multimedia Retrieval.

Tree model guided candidate generation for mining frequent subtrees from XML documents.

Ranking Query Results using Context%2DAware Preferences.

Web Information Systems %2D WISE 2006 Workshops

Modeling Dynamic Properties in the Layered View Model for XML Using XSemantic Nets.

A Context%2DAware Preference Model for Database Querying in an Ambient Intelligent Environment.

Representing real time semantics for distributed application integration.

A Context%2DAware Preference Model for Database Querying in an Ambient Intelligent Environment.

Balancing Smartness and Privacy for the Ambient Intelligence.

Cogito Componentiter Ergo Sum.

Visual Modeling of Behavioral Properties in the LVM for XML Using XSemantic Nets.

XML Descriptor Based Approach for Real Time Data Messaging.

IMB3%2DMiner Mining Induced%2FEmbedded Subtrees by Constraining the Level of Embedding.
Abstract. Tree mining has recently attracted a lot of interest in areas such as Bioinformatics, XML mining, Web mining, etc. We are mainly concerned with mining frequent induced and embedded subtrees. While more interesting patterns can be obtained when mining embedded subtrees, unfortunately mining such embedding relationships can be very costly. In this paper, we propose an efficient approach to tackle the complexity of mining embedded subtrees by utilizing a novel Embedding List representation, Tree Model Guided enumeration, and introducing the Level of Embedding constraint. Thus, when it is too costly to mine all frequent embedded subtrees, one can decrease the level of embedding constraint gradually up to 1, from which all the obtained frequent subtrees are induced subtrees. Our experiments with both synthetic and real datasets against two known algorithms for mining induced and embedded subtrees, FREQT and TreeMiner, demonstrate the effectiveness and the efficiency of the technique. 1
Modeling views in the layered view model for XML using UML.
Abstract — In data engineering, view formalisms are used to provide flexibility to users and user applications by allowing them to extract and elaborate data from the stored data sources. Conversely, since the introduction of EXtensible Markup Language (XML), it is fast emerging as the dominant standard for storing, describing, and interchanging data among various web and heterogeneous data sources. In combination with XML Schema, XML provides rich facilities for defining and constraining user-defined data semantics and properties, a feature that is unique to XML. In this context, it is interesting to investigate traditional database features, such as view models and view design techniques for XML. However, traditional view formalisms are strongly coupled to the data language and its syntax, thus it proves to be a difficult task to support views in the case of semi-structured data models. Therefore, in this paper we propose
On the Move to Meaningful Internet Systems 2005 OTM 2005 Workshops
Proceedings
Efficient XPath Evaluation.
Existing work on XML query evaluation has either focused on algebraic optimization techniques suitable for XML databases, or on algorithms to efficiently process XML messages represented as a stream of parsing events. In practice, complex applications often must handle both. In this paper, we develop a physical algebra that combines streaming operators with other standard relational and XML operators. Our physical model includes marked XML streams, which permit efficient XPath evaluation, but can only be consumed once. This constraint restricts the use of streaming operators to fragments of a query plan that only access data using depth-first traversal. We develop static analysis techniques to decide which fragment of a plan can be streamed. Our experiments demonstrate the benefits of blending streaming with other evaluation techniques. 1
On Low%2Dlevel Cognitive Components of Speech.
In this paper we analyze speech for low-level cognitive features using linear component analysis. We demonstrate generalizable component ‘fingerprints ’ stemming from both phonemes and speakers. Phonemes are fingerprints found at the basic analysis window time scale (20 msec), while speaker ‘voiceprints ’ are found at time scales around 1000 msec. The analysis is based on homomorphic filtering features and energy based sparsification. 1.
Engineering XML Solutions Using Views.
©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
A Layered View Model for XML Repositories and XML Data Warehouses.

A Three%2DLayered XML View Model A Practical Approach.

XML Views%2C Part III An UML Based Design Methodology for XML Views.

Refining the Results of Automatic e%2DTextbook Construction by Clustering.

Modeling Views for Semantic Web Using eXtensible Semantic %28XSemantic%29 Nets.

SWWS 2005 PC Co%2Dchairs%27 Message.

Modeling Views for Semantic Web Using eXtensible Semantic %28XSemantic%29 Nets.

Context for Ubiquitous Data Management.

Alternate Representations for Visual Constraint Specification in the Layered View Model.
Extensible Markup Language (XML), with its rich set of semantics and constraints, is becoming the dominant standard for storing, describing and interchanging data among various Enterprises Information Systems (EIS) and databases. With the increased reliance on such semi-structured data and schemas, there exists a requirement to model, design, and constrain semi-structured data and the associated semantics at a higher level of abstraction than at the instance or data level. But most semi-structured schema languages lack the ability to provide higher levels of abstraction, such as visual constraints, that are easily understood by humans. Conversely, though Object-Oriented (OO) conceptual models offers the power in describing and modeling real-world data semantics, constraints and their inter-relationships in a form that is precise and comprehensible to users, they provide insufficient modeling constructs for utilizing XML schema like data descriptions and constraints. Therefore, it is interesting to investigate conceptual and schema formalisms as a means of providing higher level semantics in the context of XML-related data engineering. In this paper, we present a visual constraint specification model for an XML layered view model. First we briefly outline the view model and then provide a detailed discussion on modeling issues related to view constraint specification using two OO modeling languages, namely OMG’s UML/OCL and XML Semantics (XSemantic) nets. To demonstrate our concepts, we also provide an illustrative case study example based on a real-world application. 1.
Using Object Deputy Model to Prepare Data for Data Warehousing.

An XML%2Denabled data mining query language XML%2DDMQL.

Beyond information searching and browsing acquiring knowledge from digital libraries.
As one of the most complex and advanced forms of Internet information systems, digital libraries serve as an increasingly important channel to a vast array of information sources and services. However, from the standpoint of satisfying human&#039;s information needs, the current digital library systems suffer from the following two shortcomings: (i) inadequate strategic level cognition support; (ii) inadequate knowledge sharing facilities. In this paper, we introduce a two-layered digital library architecture to support different levels of human cognitive acts. The model moves beyond simple information searching and browsing across multiple repositories, to inquiry of knowledge. To address users&#039; high-order cognitive requests, we propose an information space, consisting of a knowledge subspace and a document subspace. A formal description of the knowledge subspace for knowledge sharing and dissemination, as well as mechanisms for constructing the two subspaces, are particularly dis...
From intra%2Dtransaction to generalized inter%2Dtransaction Landscaping multidimensional contexts in association rule mining.

Advances in Web%2DAge Information Management 5th International Conference

Towards Context%2DAware Data Management for Ambient Intelligence.

A Self%2Dadaptive Scope Allocation Scheme for Labeling Dynamic XML Documents.

Mining Interesting XML%2DEnabled Association Rules with Templates.

Efficient Tree Search in Encrypted Data.
Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document.
Preparations for encrypted XML metadata querying.

Efficient Tree Search in Encrypted Data.
Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document.
Managing Multiuser Database Buffers Using Data Mining Techniques.

XML Views Part 1.

An XML%2DEnabled Association Rule Framework.
Abstract. XML-enabled association rule framework [8] extends the notion of associated items to XML fragments to present associations among trees rather than simple-structured items of atomic values. They are more flexible and powerful in representing both simple and complex structured association relationships inherent in XML data. Compared with traditional association mining in the well-structured world, mining from XML data, however, is confronted with more challenges due to the inherent flexibilities of XML in both structure and semantics. The primary challenges include 1) a more complicated hierarchical data structure; 2) an ordered data context; and 3) a much bigger data size. In order to make XML-enabled association rule mining truly practical and computationally tractable, in this study, we present a template model to help users specify the interesting XML-enabled associations to be mined. Techniques for template-guided mining of association rules from large XML data are also described in the paper. We demonstrate the effectiveness of these techniques through a set of experiments on both synthetic and real-life data. 1
Web%2DBased Distributed XML Query Processing.

Efficient Processing of Secured XML Metadata.

Schemata transformation of object%2Doriented conceptual models to XML.

Editorial.
calls &amp; calendarEDITORIAL
Using Fuzzy Linguistic Representations to Provide Explanatory Semantics for Data Warehouses.
Abstract—A data warehouse integrates large amounts of extracted and summarized data from multiple sources for direct querying and analysis. While it provides decision makers with easy access to such historical and aggregate data, the real meaning of the data has been ignored. For example, “whether a total sales amount 1,000 items indicates a good or bad sales performance ” is still unclear. From the decision makers ’ point of view, the semantics rather than raw numbers which convey the meaning of the data is very important. In this paper, we explore the use of fuzzy technology to provide this semantics for the summarizations and aggregates developed in data warehousing systems. A three layered data warehouse semantic model, consisting of quantitative (numerical) summarization, qualitative (categorical) summarization, and quantifier summarization, is proposed for capturing and explicating the semantics of warehoused data. Based on the model, several algebraic operators are defined. We also extend the SQL language to allow for flexible queries against such enhanced data warehouses. Index Terms—Data warehouse, semantic model, algebraic operator, extended SQL, fuzzy set, membership function. 1
Fully Dynamic Partitioning Handling Data Skew in Parallel Data Cube Computation.

Efficient Mining of Intertransaction Association Rules.

Using Fuzzy Linguistic Representations to Provide Explanatory Semantics for Data Warehouses.
Abstract—A data warehouse integrates large amounts of extracted and summarized data from multiple sources for direct querying and analysis. While it provides decision makers with easy access to such historical and aggregate data, the real meaning of the data has been ignored. For example, “whether a total sales amount 1,000 items indicates a good or bad sales performance ” is still unclear. From the decision makers ’ point of view, the semantics rather than raw numbers which convey the meaning of the data is very important. In this paper, we explore the use of fuzzy technology to provide this semantics for the summarizations and aggregates developed in data warehousing systems. A three layered data warehouse semantic model, consisting of quantitative (numerical) summarization, qualitative (categorical) summarization, and quantifier summarization, is proposed for capturing and explicating the semantics of warehoused data. Based on the model, several algebraic operators are defined. We also extend the SQL language to allow for flexible queries against such enhanced data warehouses. Index Terms—Data warehouse, semantic model, algebraic operator, extended SQL, fuzzy set, membership function. 1
A Strategic Level for Scientific Digital Libraries.

A semantic network%2Dbased design methodology for XML documents.
The eXtensible Markup Language (XML) is fast emerging as the dominant standard for describing and interchanging data among various systems and databases on the Internet. It offers the Document Type Definition (DTD) as a formalism for defining the syntax and structure of XML documents. The XML Schema definition language, as a replacement for the DTD, provides more rich facilities for defining and constraining the content of XML documents. However, it does not concentrate on the semantics that underlies these documents, representing a logical data model rather than a conceptual model. To enable efficient business application development in large-scale electronic commerce environments, it is necessary to describe and model real-world data semantics and their complex interrelationships. In this article, we describe a design methodology for XML documents. The aim is to enforce XML conceptual modeling power and bridge the gap between software development and XML document structures. The proposed methodology is comprised of two design levels: the semantic level and the schema level. The first level is based on a semantic network, which provides semantic modeling of XML through four major components: a set of atomic and complex nodes, representing real-world objects; a set of directed edges, representing semantic relationships between the objects; a set of labels denoting different types of semantic relationships, including aggregation, generalization, association, and of-property relationships; and finally a set of constraints defined over nodes and edges to constrain semantic relationships and object domains. The other level of the proposed methodology is concerned with detailed XML schema design, including element/attribute declarations and simple/complex type definitions. The mapping between the two design levels is proposed to transform the XML semantic model into the XML Schema, based on which XML documents can be systematically created, managed, and validated.
A template model for multidimensional inter%2Dtransactional association rules.

Modeling and Transformation of Object%2DOriented Conceptual Models into XML Schema.

Mining Inter%2Dtransactional Association Rules Generalization and Empirical Evaluation.

Inter%2Dtransactional association rules for multi%2Ddimensional contexts for prediction and their application to studying meteorological data.

Towards Knowledge%2DBased Digital Libraries.

Analysis of Distributed Database Access Histories for Buffer Allocation.

Beyond intratransaction association analysis mining multidimensional intertransaction association rules.

Mining Inter%2DTransaction Associations with Templates.
Multi-dimensional, inter-transaction association rules extend the traditional association rules to describe more general associations among items with multiple properties cross transactions. &#034;After McDonald and Burger King open branches, KFC will open a branch two months later and one mile away&#034; is an example of such rules. Since the number of potential inter-transaction association rules tends to be extremely large, mining inter-transaction associations poses more challenges on efficient processing than mining intra-transaction associations. In order to make such association mining truly practical and computationally tractable, in this study, we present a template model to help users declare the interesting inter-transaction associations to be mined. With the guidance of templates, several optimization techniques are devised to speed up the discovery of inter-transaction association rules. We show, through a series of experiments, that these optimization techniques can yield significa...
Supporting Web%2DBased Database Application Development.
This paper discusses our experiences of designing and implementing a pure JAVA database proxy server with a JDBC compatible driver for Intranet/Internet database application development. In particular, we present a shared database connection strategy and flexible caching facilities to address the scalability problem. Web clients with the same access privilege can maintain their logical connections with shared physical connections to the database. Thus, not only a large number of users can be entertained by limited physical resource, the connection cost is also not indulged for each individual client. Web clients can also express their cache requirements explicitly in the JDBC protocol so that a large number of clients can be served with improved response time. The effectiveness of such strategies is demonstrated through a set of experiments. 1. Introduction During the past decade, the power and maturity of the database technology have made database systems and related applications most...
Enhancing Data Warehousing with Fuzzy Technology.

Design and Selection of Materialized Views in a Data Warehousing Environment A Case Study.
In this paper, we describe the design of a data warehousing system for an engineering company `R&#039;. This system aims to assist users in retrieving data for business analysis in an efficient manner. The structural design of this data warehousing system employs the dimensional modeling concepts of star and snowflake schemes. Furthermore, frequently accessed dimension keys and attributes are stored in various summary views (materialized views) in order to minimize the query processing cost. A cost model was developed to enable the evaluation of the total cost and benefit involved in selecting each materialized view. Using the cost analysis methodology for evaluation, an adapted greedy algorithm has been implemented for the selection of materialized views. This algorithm takes into account all of the cost variables associated with the materialized views selection method, including query access frequencies, base-data update frequencies, query access costs, view maintenance costs and the availability of the system&#039;s storage. The algorithm and cost model have been applied to a set of real-life database items extracted from company `R&#039;. By selecting the most cost effective set of materialized summary views, the total cost of the maintenance, storage and query processing of the system is optimized, thereby resulting in an efficient data warehousing system  1. 
Breaking the Barrier of Transactions Mining Inter%2DTransaction Association Rules.

Efficient Search of Reliable Exceptions.
. Finding patterns from data sets is a fundamental task of data mining. If we categorize all patterns into strong, weak, and random,  conventional data mining techniques are designed only to find strong patterns, which hold for numerous objects and are usually consistent with the expectations of experts. While such strong patterns are helpful in prediction, the unexpectedness and contradiction exhibited by weak patterns are also very useful although they represent a relatively small number of objects. In this paper, we address the problem of finding weak patterns (i.e., reliable exceptions) from databases. A simple and efficient approach is proposed which uses deviation analysis to identify interesting exceptions and explore reliable ones. Besides, it is flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a set of real-life data sets, and present interesting findings. 1 Introduction  Data mining has attracted ...
Buffer Management in Distributed Database Systems A Data Mining Based Approach.
. In this paper, we propose a data mining-based approach to public buffer management in distributed database systems where database buffers are organized into two areas: public and private. While the private buffer areas contain pages to be updated by particular users, the public buffer area contains pages shared among users from different sites. Different from traditional buffer management strategies where limited knowledge of user access patterns is used, the proposed approach discovers knowledge from page access sequences of user transactions and uses it to guide public buffer placement and replacement. The knowledge to be discovered and the discovery algorithms are discussed. The effectiveness of the proposed approach was investigated through a simulation study. The results indicate that with the help of the discovered knowledge, the public buffer hit ratio can be improved significantly. 1 Introduction Due to the higher cost of fetching data from disk than from RAM, most database ...
Integrating Database and World Wide Web Technologies.
Integrating database and World Wide Web technologies is another topic where industrial and practical activities lead ahead of academic ones. The purpose of this article is to survey the related activities from database people&#039;s view and stimulate the interests among the database community. It covers three aspects. First, the efforts that apply established database techniques to retrieving Web information are summarized. These efforts aim to overcome the inadequacy of file system technology on which the Web is based, so that information can be retrieved easily and quickly from the Web. Second, various approaches to interfacing databases via the Web are discussed, with examples of accomplished prototypes and commercial products showing recent advances. Finally, some possible extensions to the traditional database techniques are investigated for building fully fledged Web-based database applications. Keyword Phrases: Internet, the World Wide Web, interfacing databases with the Web, Web-li...
